Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms (Extended Abstract)
نویسندگان
چکیده
Crystal lattices are in nite periodic graphs that occur naturally in a variety of geometries and which are of fundamental importance in polymer science. Discrete models of protein folding use crystal lattices to de ne the space of protein conformations. Because various crystal lattices provide discretizations of the same physical phenomenon, it is reasonable to expect that there will exist \invariants" across lattices related to fundamental properties of the protein folding process. This paper considers whether performance-guaranteed approximability is such an invariant for HP lattice models. We de ne a master approximation algorithm that has provable performance guarantees provided that a speci c sublattice exists within a given lattice. We describe a broad class of crystal lattices that are approximable, which further suggests that approximability is a general property of HP lattice models.
منابع مشابه
Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms
A b s t r a c t . Crystal lattices are infinite periodic graphs that occur naturally in a variety of geometries and which are of fundamental importance in polymer science. Discrete models of protein folding use crystal lattices to define the space of protein conformations. Because various crystal lattices provide discretizations of the same physical phenomenon, it is reasonable to expect that t...
متن کاملPredicting Protein Folding Kinetics via Temporal Logic Model Checking: Extended Abstract
Christopher James Langmead and Sumit Kumar Jha Department of Computer Science, Carnegie Mellon University Abstract. We present a novel approach for predicting protein folding kinetics using techniques from the field of model checking. This represents the first time model checking has been applied to a problem in the field of structural biology. The protein’s energy landscape is encoded symbolic...
متن کاملStudies of protein designability using reduced models
One the most important problems in computational structural biology is protein designability, that is, why protein sequences are not random strings of amino acids but instead show regular patterns that encode protein structures. Many previous studies that have attempted to solve the problem have relied upon reduced models of proteins. In particular, the 2D square and the 3D cubic lattices toget...
متن کاملA New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated and applied to address the problem of solving the abinitio protein structure prediction problem—i.e., predicting the 3D structure of a protein from its amino acid sequence. Experimental results demonstrate that our novel approach ...
متن کامل